On the single-server retrial queue

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Single-server Retrial Queue

In this work, we review the stochastic decomposition for the number of customers in M/G/1 retrial queues with reliable server and server subjected to breakdowns which has been the subject of investigation in the literature. Using the decomposition property of M/G/1 retrial queues with breakdowns that holds under exponential assumption for retrial times as an approximation in the non-exponential...

متن کامل

A Single Server Retrial Queue in Bernoulli Schedule With Feedback on Non-Retrial Customers

In this paper, we consider an M/G/1 retrial queue with Bernoulli feedback and general retrial times where the external arrivals blocked either with probability q join the infinite waiting room called non-retrial queue or with probability p, (p+q = 1) leave the service area and enter the retrial group called orbit in FIFO discipline. Also we assume that only the customer at the head of the orbit...

متن کامل

Stochastic bounds for a single server queue with general retrial times

We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds‎. ‎The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques‎.

متن کامل

A Single Server Retrial Queue with Different Types of Server Interruptions

We consider a single server retrial queue with the server subject to interruptions and classical retrial policy for the access from the orbit to the server. We analyze the equilibrium distribution of the system and obtain the generating functions of the limiting distribution.

متن کامل

stochastic bounds for a single server queue with general retrial times

we propose to use a mathematical method based on stochastic comparisons of markov chains in order to derive performance indice bounds‎. ‎the main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (fcfs) orbit and general retrial times using the stochastic ordering techniques‎.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: YUJOR

سال: 2006

ISSN: 0354-0243,1820-743X

DOI: 10.2298/yjor0601045d